Large semigroups of cellular automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large semigroups of cellular automata

In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to “largeness”. The first property is ID and the other property is maximal commutativity (MC). A semigroup has the ID property if the only infinite invariant closed set (with respect to the semigroup ...

متن کامل

Large Semigroup of Cellular Automata

Abstract. In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to “largeness”. The first property is ID and the other property is maximal commutativity (MC). A semigroup has the ID property if the only infinite invariant closed set (with respect to the ...

متن کامل

Automata and automata mappings of semigroups

The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are related to cascade connections of automata of the first type. The introduced automata play a significant role in group theory and, hopefully, in the theory o...

متن کامل

Large Deviations for Probabilistic Cellular Automata

We consider a generalized model of a probabilistic cellular automata described by a Markov chain on an infinite dimensional space and derive certain large deviations bounds for corresponding occupational measures.

متن کامل

on residually finite semigroups of cellullar automata

we prove that if $m$ is a monoid and $a$ a finite set with more than one element‎, ‎then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ergodic Theory and Dynamical Systems

سال: 2011

ISSN: 0143-3857,1469-4417

DOI: 10.1017/s0143385711000551